Heterogeneous Vehicles Routing for Water Canal Damage Assessment

نویسندگان

  • Di Deng
  • Tao Pang
  • Prasanth Palli
  • Fang Shu
  • Kenji Shimada
چکیده

In Japan, inspection of irrigation water canals has been mostly conducted manually. However, the huge demand for more regular inspections as infrastructure ages, coupled with the limited time window available for inspection, has rendered manual inspection increasingly insufficient. With shortened inspection time and reduced labor cost, automated inspection using a combination of unmanned aerial vehicles (UAVs) and ground vehicles (cars) has emerged as an attractive alternative to manual inspection. In this paper, we propose a path planning framework that generates optimal plans for UAVs and cars to inspect water canals in a large agricultural area (tens of square kilometers). In addition to optimality, the paths need to satisfy several constraints, in order to guarantee UAV navigation safety and to abide by local traffic regulations. In the proposed framework, the canal and road networks are first modeled as two graphs, which are then partitioned into smaller subgraphs that can be covered by a given fleet of UAVs within one battery charge. The problem of finding optimal paths for both UAVs and cars on the graphs, subject to the constraints, is formulated as a mixed-integer quadratic program (MIQP). The proposed framework can also quickly generate new plans when a current plan is interrupted. The effectiveness of the proposed framework is validated by simulation results showing the successful generation of plans covering all given canal segments, and the ability to quickly revise the plan when conditions change.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a multi-depot location-routing problem with heterogeneous vehicles and fuzzy travel times by a meta-heuristic algorithm

A capacitated location-routing problem (CLRP) is one of the new areas of research in distribution management. It consists of two problems; locating of facilities and routing of the vehicle with a specific capacity. The purpose of the CLRP is to open a set of stores, allocate customers to established deposits, and then design vehicle tours in order to minimize the total cost. In this paper, a ne...

متن کامل

A location-routing model for assessment of the injured people and relief distribution under uncertainty

Throughout history, nature has exposed humans to destructive phenomena such as earthquakes, floods, droughts, tornadoes, volcanic eruptions, and tropical and marine storms. The large scale of damages and casualties caused by natural disasters around the world has led to extensive applied research in the field of preparation and development of a comprehensive system for disaster management to mi...

متن کامل

Multi-objective routing and scheduling for relief distribution with split delivery in post-disaster response

Following the occurrence of unexpected events and natural disasters, a highly important relief operation is the transferring of relief commodities from the distribution centers (CDs) to shelters. In this paper, a three-level network consisting of depot of vehicles, distribution centers and shelters has been considered for routing and scheduling of relief vehicles through introducing a multi-obj...

متن کامل

A Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet

Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...

متن کامل

A Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem

The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018